Adding probabilities to timed automata to improve landcover classification
نویسندگان
چکیده
The aim of this paper is to propose the use of a dynamic plot model to improve landcover classification on a sequence of images. This new approach consists in representing the plot as a dynamic system and in modeling its evolution (knowledge about crop cycles) using the timed automata formalism. In order to refine the results obtained by a traditional classifier, the observations given by a preliminary classification of images are combined with the expected states provided by simulation. The paper presents the general method, based on prediction and postdiction mechanisms, that have been adopted to improve the classification of a sequence of images. In a first experiment, plots are modelled using a timed automata formalism. The analysis of the results clearly demonstrates the interest of the method. A second experiment, in which plots are modelled using probabilistic timed automata, is described in a last section. The changes in the method are presented and the results are compared with the previous ones.
منابع مشابه
Timed Automata Model to Improve the Classification of a Sequence of Images
The aim of this paper is to propose the use of a dynamic plot model to improve landcover classification on a sequence of images. This new approach consists in representing the plot as a dynamic system and in modeling its evolution (knowledge about crop cycles) using the timed automata formalism. In order to refine results obtained by a traditional classifier, observations given by a preliminary...
متن کاملImproving the landcover classification using domain knowledge
This paper deals with the integration of domain knowledge to improve the landcover classification of a sequence of images. This new approach consists in representing the plot of land as a dynamic system and in modeling its evolution (knowledge about crop cycles, rotations and farmer practices) with the timed automata formalism. The main feature of this work is to improve the classification prov...
متن کاملProbabilistic Timed Automata with Clock-Dependent Probabilities
Probabilistic timed automata are classical timed automata extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic timed automata, a variant of probabilistic timed automata in which transition probabilities can depend linearly on clock values. Clock-dependent probabilistic timed automata allow the modelling of a continuous relationship between time...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملComputing Maximum Reachability Probabilities in Markovian Timed Automata
We propose a novel stochastic extension of timed automata, i.e. Markovian Timed Automata (MTA). We study the problem of optimizing the reachability probabilities in this model. Two variants are considered, namely, the timebounded and unbounded reachability. In each case, we propose Bellman equations to characterize the probability. For the former, we provide two approaches to solve the Bellman ...
متن کامل